Graphical Frobenius representations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphical representations of clutters

We discuss the use of K-terminal networks to represent arbitrary clutters. A given clutter has many di¤erent representations, and there does not seem to be any set of simple transformations that can be used to transform one representation of a clutter into any other. We observe that for t 2 the class of clutters that can be represented using no more than t terminals is closed under minors, and ...

متن کامل

Derivative Meaning in Graphical Representations

This paper reports on the phenomenon that may be called “derivative meaning,” where the basic semantic conventions for certain graphical representation systems give rise to additional informational relations between features of representations and features of the represented. We will discuss several examples of graphical systems, such as the systems of scatter plots, data maps, and tabular repr...

متن کامل

Graphical Representations of Consensus Belief

Graphical models based on conditional independence support concise encodings of the subjective belief of a single agent. A natural question is whether the consensus belief of a group of agents can be represented with equal parsimony. We prove, under relatively mild assumptions, that even if everyone agrees on a common graph topology, no method of combining beliefs can maintain that structure. E...

متن کامل

Analytic Representations in the 3-dim Frobenius Problem

We consider the Diophantine problem of Frobenius for semigroup S ( d ) where d denotes the tuple (d1, d2, d3), gcd(d1, d2, d3) = 1. Based on the Hadamard product of analytic functions [17] we have found the analytic representation for the diagonal elements akk ( d ) of the Johnson’s matrix of minimal relations [12] in terms of d1, d2, d3. Bearing in mind the results of the recent paper [10] thi...

متن کامل

Frobenius characters for set representations of symmetric groups

For any set representation (permutation representation) of the symmetric group Sn, we give combinatorial interpretation for coefficients of its Frobenius character expanded in the basis of monomial symmetric functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2018

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-018-0814-6